The Decidability of the Reachability Problem for CCS!
نویسنده
چکیده
CCS is a variant of CCS in which infinite behaviours are defined by the replication operator. We show that the reachability problem for CCS is decidable by a reduction to the same problem for Petri Nets.
منابع مشابه
Analysis of the reachability problem in fragments of the π - calculus
The π-calculus is one of the most important formalisms for analyzing and modelling concurrent systems. It is a simple but powerful tool for specifying and checking several properties in this kind of systems. An interesting property of any system is the ability to reach some special state where it has a particular behavior. In security systems this is extremely important, since we would like tha...
متن کاملReachability is Decidable for Ground AC Rewrite Systems
The reachability problem for ground associative-commutative (AC) rewrite systems is decidable. We show that ground AC rewrite systems are equivalent to Process Rewrite Systems (PRS) for which reach-ability is decidable 4]. However, the decidability proofs for PRS are cumbersome and thus we present a simpler and more readable proof in the framework of ground AC rewrite systems. Moreover, we show...
متن کاملOn parametric timed automata and one-counter machines
Two decades ago, Alur, Henzinger, and Vardi introduced the reachability problem for parametric timed automata in the seminal paper [2]. Their main results are that reachability is decidable for timed automata with a single parametric clock, and undecidable for timed automata with three or more parametric clocks. In the case of two parametric clocks, decidability was left open, with hardly any p...
متن کاملWhat ' s Decidable about Hybrid Automata ? 1
Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many veriication tasks for such programs can be expressed as reachability problems for hybrid au-tomata. By improving on previous decidability and un-decidability results, we identify the precise boundary between decidability and undecidability of the reachability problem for hybrid automat...
متن کاملDecidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
In Petri nets with data, every token carries a data value, and executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems for Petri nets with data may depend on the structure of data domain. For instance, if data values are only tested for equality, decidability status of the reachability problem is unknown (but deci...
متن کامل